On the Number of Restricted Dyck Paths
نویسندگان
چکیده
In this note we examine the number of integer lattice paths consisting of up-steps (1, 1) and down-steps (1,−1) that do not touch the lines y = m and y = −k, and in particular Theorem 3.2 in [P. Mladenović, Combinatorics, Mathematical Society of Serbia, Belgrade, 2001]. The theorem is shown to be incorrect for n > m + k + min(m, k), and using similar combinatorial technique we proved the upper and lower bound for the number of such restricted Dyck paths. In conclusion, we present some relations between the Chebyshev polynomials of the second kind and generating function for the number of restricted Dyck paths, and connections with the spectral moments of graphs and the Estrada index.
منابع مشابه
Dyck Paths with Peaks Avoiding or Restricted to a Given Set
In this paper we focus on Dyck paths with peaks avoiding or restricted to an arbitrary set of heights. The generating functions of such types of Dyck paths can be represented by continued fractions. We also discuss a special case that requires all peak heights to either lie on or avoid a congruence class (or classes) modulo k. The case when k = 2 is especially interesting. The two sequences for...
متن کاملEnumeration of area-weighted Dyck paths with restricted height
Dyck paths are directed walks on Z starting at (0, 0) and ending on the line y = 0, which have no vertices with negative y-coordinates, and which have steps in the (1, 1) and (1,−1) directions [11]. We impose the additional geometrical constraint that the paths have height at most h, that is, they lie between lines y = 0 and y = h. Given a Dyck path π, we define the length n(π) to be half the n...
متن کاملStatistics on Pattern-avoiding Permutations
This thesis concerns the enumeration of pattern-avoiding permutations with respect to certain statistics. Our first result is that the joint distribution of the pair of statistics ‘number of fixed points’ and ‘number of excedances’ is the same in 321-avoiding as in 132-avoiding permutations. This generalizes a recent result of Robertson, Saracino and Zeilberger, for which we also give another, ...
متن کاملPermutations with Restricted Patterns and Dyck Paths
We exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijection, it is shown that all the recently discovered results on generating functions for 132-avoiding permutations with a given number of occurrences of the pattern 12 . . . k follow directly from old results on the enumeration of Motzkin paths, among which is a continued fraction result due to Flajolet. As a...
متن کاملA Simple and Unusual Bijection for Dyck Paths and Its Consequences Sergi Elizalde and Emeric Deutsch
In this paper we introduce a new bijection from the set of Dyck paths to itself. This bijection has the property that it maps statistics that appeared recently in the study of pattern-avoiding permutations into classical statistics on Dyck paths, whose distribution is easy to obtain. We also present a generalization of the bijection, as well as several applications of it to enumeration problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011